Incongruity unit as minimum unit of humor stimulus
نویسندگان
چکیده
منابع مشابه
Incongruity-resolution in English Humor
Humor is a common phenomenon in language. One importance prerequisite of its humor effect lies in its incongruity, in the framework of relevance theory that is, the deviation from relevance expectations. According to the features of incongruity-resolution, the article makes the following classification of the humor: garden-path, cognitive contrast and inferring the implication.
متن کاملPre-stimulus Vta Single Unit Activity 1
Title: Distinct pre-stimulus and post-stimulus activation of VTA neurons correlates with stimulus 1 detection 2 3 Authors: Nelson K. B. Totah, Yunbok Kim, Bita Moghaddam 4 5 Author Contributions: N.T. and B.M. designed the study, N.T. and Y.K. performed the 6 experiment and analyzed the data, N.T. wrote the first draft of the manuscript. All authors edited 7 the manuscript. 8 9 Addresses: 1. Ce...
متن کاملhazard evaluation of gas condensate stabilization and dehydration unit of parsian gas refinery using hazop procedures
شناسایی مخاطرات در واحد 400 پالایشگاه گاز پارسیان. در این پروزه با بکارگیری از تکنیک hazop به شناسا یی مخاطرات ، انحرافات ممکن و در صورت لزوم ارایه راهکارهای مناسب جهت افزایش ایمنی فرا یند پرداخته میگردد. شرایط عملیاتی مخاطره آمیز نظیر فشار و دمای بالا و وجود ترکیبات مختلف سمی و قابل انفجار در واحدهای پالایش گاز، ضرورت توجه به موارد ایمنی در این چنین واحدهایی را مشخص می سازد. مطالعه hazop یک ر...
Alcohol minimum unit pricing and socioeconomic status
1616 www.thelancet.com Vol 383 May 10, 2014 Floor prices for alcohol, beneath which alcohol cannot be sold, are in place in Moldova, Russia, Ukraine, Uzbekistan, some US states (eg, Connecticut), and eight of the ten Canadian provinces. In 2012, Scotland legislated alcohol minimum unit pricing—a lowest price per unit of alcohol—the introduction of which is pending legal challenge. In the UK, mi...
متن کاملMinimum clique partition in unit disk graphs
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding unit disk graph (UDG) has these points as vertices, and edges connecting points at distance at most 1. MCP in unit disk graphs is known to be NP-hard and several constant factor approximations are known, including a r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Proceedings of the Annual Convention of the Japanese Psychological Association
سال: 2010
ISSN: 2433-7609
DOI: 10.4992/pacjpa.74.0_3ev047